home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Aminet 24
/
Aminet 24 (1998)(GTI - Schatztruhe)[!][Apr 1998].iso
/
Aminet
/
dev
/
lang
/
PPCSmllEiffel.lha
/
PPCSmallEiffel
/
lib_se
/
manifest_array.e
< prev
next >
Wrap
Text File
|
1998-01-16
|
9KB
|
447 lines
-- This file is part of SmallEiffel The GNU Eiffel Compiler.
-- Copyright (C) 1994-98 LORIA - UHP - CRIN - INRIA - FRANCE
-- Dominique COLNET and Suzanne COLLIN - colnet@loria.fr
-- http://www.loria.fr/SmallEiffel
-- SmallEiffel is free software; you can redistribute it and/or modify it
-- under the terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 2, or (at your option) any later
-- version. SmallEiffel is distributed in the hope that it will be useful,but
-- WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-- for more details. You should have received a copy of the GNU General
-- Public License along with SmallEiffel; see the file COPYING. If not,
-- write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-- Boston, MA 02111-1307, USA.
--
class MANIFEST_ARRAY
--
-- Like : << foo , bar >>
--
inherit EXPRESSION;
creation make
feature
start_position: POSITION;
-- Of first character '<'.
list: ARRAY[EXPRESSION];
-- Void or elements in the array.
result_type: TYPE_ARRAY;
-- Computed according to the actual `list'.
make(sp: like start_position; l: like list) is
require
sp /= Void;
l /= Void implies not l.empty and l.lower =1;
do
start_position := sp;
list := l;
ensure
start_position = sp;
list = l;
end;
precedence: INTEGER is 2;
is_static: BOOLEAN is false;
can_be_dropped: BOOLEAN is false;
c_simple: BOOLEAN is false;
feature
isa_dca_inline_argument: INTEGER is
-- *** A FAIRE ??? ***
do
end;
dca_inline_argument(formal_arg_type: TYPE) is
-- *** FAIRE ***
do
end;
is_pre_computable: BOOLEAN is
local
i: INTEGER;
e: EXPRESSION;
do
if list = Void then
Result := true;
elseif result_type.generic_list.item(1).is_string then
from
Result := true;
i := list.upper;
until
not Result or else i = 0
loop
e := list.item(i);
Result := e.is_pre_computable;
i := i - 1;
end;
end;
end;
afd_check is
local
i: INTEGER;
do
if list /= Void then
from
i := list.upper;
until
i = 0
loop
list.item(i).afd_check;
i := i - 1;
end;
end;
end;
frozen mapping_c_target(target_type: TYPE) is
do
cpp.put_character('(');
cpp.put_character('(');
cpp.put_character('T');
cpp.put_integer(target_type.id);
cpp.put_character('*');
cpp.put_character(')');
compile_to_c;
cpp.put_character(')');
end;
frozen mapping_c_arg(formal_arg_type: TYPE) is
do
compile_to_c;
end;
compile_to_c is
local
i: INTEGER;
formal_type, actual_type: TYPE;
adr: BOOLEAN;
e: EXPRESSION;
do
manifest_array_pool.c_call(result_type);
formal_type := result_type.generic_list.item(1).run_type;
cpp.put_character('(');
if list = Void then
cpp.put_character('0');
else
adr := formal_type.is_user_expanded;
cpp.put_integer(list.upper);
from
i := 1;
until
i > list.upper
loop
cpp.put_character(',');
if adr then
cpp.put_character('&');
end;
e := list.item(i);
actual_type := e.result_type.run_type;
if formal_type.is_reference and then actual_type.is_expanded then
actual_type.to_reference;
cpp.put_character('(');
e.compile_to_c;
cpp.put_character(')');
else
e.compile_to_c;
end;
i := i + 1;
end;
end;
cpp.put_character(')');
end;
compile_to_c_old is
local
i: INTEGER;
do
if list /= Void then
from
i := list.upper;
until
i = 0
loop
list.item(i).compile_to_c_old;
i := i - 1;
end;
end;
end;
compile_to_jvm_old is
local
i: INTEGER;
do
if list /= Void then
from
i := list.upper;
until
i = 0
loop
list.item(i).compile_to_jvm_old;
i := i - 1;
end;
end;
end;
compile_target_to_jvm, compile_to_jvm is
local
rt, elt_type: TYPE;
i, idx, space: INTEGER;
rc: RUN_CLASS;
idx_rc: INTEGER;
cp: like constant_pool;
ca: like code_attribute;
do
cp := constant_pool;
ca := code_attribute;
rt := result_type.run_type;
rc := rt.run_class;
elt_type := rt.generic_list.item(1).run_type;
idx_rc := rc.fully_qualified_constant_pool_index;
ca.opcode_new(idx_rc);
-- Set lower :
idx := cp.idx_fieldref4(idx_rc,us_lower,fz_30);
ca.opcode_dup;
ca.opcode_iconst_1;
ca.opcode_putfield(idx,-2);
-- Set upper :
idx := cp.idx_fieldref4(idx_rc,us_upper,fz_30);
ca.opcode_dup;
if list = Void then
ca.opcode_iconst_m1;
else
ca.opcode_push_integer(list.count);
end;
ca.opcode_putfield(idx,-2);
-- Set capacity :
idx := cp.idx_fieldref4(idx_rc,us_capacity,fz_30);
ca.opcode_dup;
if list = Void then
ca.opcode_iconst_0;
else
ca.opcode_push_integer(list.count);
end;
ca.opcode_putfield(idx,-2);
-- Set storage :
idx := cp.idx_fieldref4(idx_rc,us_storage,sd(elt_type));
ca.opcode_dup;
if list = Void then
ca.opcode_aconst_null;
else
ca.opcode_push_integer(list.count);
elt_type.jvm_xnewarray;
from
i := 1;
until
i > list.upper
loop
ca.opcode_dup;
ca.opcode_push_integer(i - 1);
space := list.item(i).compile_to_jvm_into(elt_type);
elt_type.jvm_xastore;
i := i + 1;
end;
end;
ca.opcode_putfield(idx,-2);
end;
jvm_branch_if_false: INTEGER is
do
end;
jvm_branch_if_true: INTEGER is
do
end;
compile_to_jvm_into(dest: TYPE): INTEGER is
do
Result := 1;
compile_to_jvm;
end;
compile_to_jvm_assignment(a: ASSIGNMENT) is
do
end;
use_current: BOOLEAN is
local
i: INTEGER;
do
if list /= Void then
from
i := list.upper;
until
i = 0 or else Result
loop
Result := list.item(i).use_current;
i := i - 1;
end;
end;
end;
to_runnable(ct: TYPE): like Current is
local
i: INTEGER;
e: EXPRESSION;
t: TYPE;
do
if current_type = Void then
current_type := ct;
if list = Void then
t := type_any;
else
from
i := list.upper;
until
i = 0
loop
e := list.item(i).to_runnable(ct);
if e = Void then
eh.add_position(start_position);
error(list.item(i).start_position,
"Bad expression in manifest array.");
i := 0;
else
list.put(e,i);
if t = Void then
t := e.result_type;
else
t := t.smallest_ancestor(e.result_type);
end;
i := i - 1;
end;
end;
end;
if nb_errors = 0 then
!!result_type.make(start_position,t.run_type);
result_type := result_type.to_runnable(current_type);
result_type.run_class.set_at_run_time;
Result := Current;
if t.is_reference and then list /= Void then
from
i := list.upper;
until
i = 0
loop
t := list.item(i).result_type;
if t.is_expanded then
t.used_as_reference;
end
i := i - 1;
end;
end;
end;
else
if list = Void then
!!Result.make(start_position,Void);
else
!!Result.make(start_position,list.twin);
end;
Result := Result.to_runnable(ct);
end;
end;
bracketed_pretty_print is
do
fmt.put_character('(');
pretty_print;
fmt.put_character(')');
end;
pretty_print is
local
i: INTEGER;
do
fmt.put_string(fz_c_shift_left);
fmt.level_incr;
if list /= Void then
from
i := 1;
until
i > list.upper
loop
list.item(i).pretty_print;
i := i +